Bezout Curves in the Plane
نویسنده
چکیده
First, recall how Bezout’s Theorem can be made more precise by specifying the meaning of the word “generically” used above, using elementary scheme-theoretic language ([H, II]). Fix an algebraically closed field k. There is little loss in assuming k = C (until Section 3). Since we work over an algebraically closed field, we often identify reduced algebraic sets with their k-valued points. In this paper, a plane curve over k is a purely 1-dimensional closed subscheme of P2 (not necessarily reduced or irreducible, but projective by definition). Such a scheme is always of the form Proj(k[X,Y, Z]/(f)) for some homogeneous polynomial f ∈ k[X,Y, Z], uniquely determined up to scalars ([H, I.1.13]), hence curves of a given degree d > 1 are naturally parameterized by an irreducible algebraic variety Hd over k, namely the projective space PN−1 k associated with the N = (d + 1)(d + 2)/2 coefficients of a homogeneous polynomial P ∈ k[X,Y, Z] of degree d (which gives the equation for the curve). We also consider subsets S ⊂ P2(k) of the set of closed points of P2, and say that such an S is a curve when S = C(k) for some plane curve C, and C is unambiguously defined if we ask that it be reduced. Similarly the Zariski closure of a subset S ⊂ P2(k) is the smallest reduced closed subscheme S with S ⊂ S(k). Now a more precise form of Bezout’s Theorem is: let C/k be a reduced curve of degree c. Then for any d > 1, there exists a Zariski open subset Ud ⊂ Hd such that for all curves D ∈ Ud, and all x ∈ C ∩D, i(C,D;x) = 1. Hence, for D outside a closed subset of Hd, the intersection C ∩D is a finite set with cd elements.
منابع مشابه
Generalized Bezout's theorem and its applications in coding theory
This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two or more plane curves. A new approach to determine a lower bound on the minimum distance for algebraic-geometric codes defined from a class of plane curves is introduced, based on the generalized Bezout theorem. Examples of more efficient l...
متن کاملGeometric Applications of the Bezout Matrix in the Bivariate Tensor-Product Lagrange basis
Using a new formulation of the Bézout matrix, we construct bivariate matrix polynomials expressed in a tensor-product Lagrange basis. We use these matrix polynomials to solve common tasks in computer-aided geometric design. For example, we show that these bivariate polynomials can serve as stable and efficient implicit representations of plane curves for a variety of curve intersection problems.
متن کاملAn Upper Bound of the Bezout Number for Piecewise Algebraic Curves over a Rectangular Partition
A piecewise algebraic curve is a curve defined by the zero set of a bivariate spline function. Given two bivariate spline spaces Sm Δ and S t n Δ over a domain D with a partition Δ, the Bezout number BN m,r;n,t;Δ is defined as the maximum finite number of the common intersection points of two arbitrary piecewise algebraic curves f x, y 0 and g x, y 0, where f x, y ∈ Sm Δ and g x, y ∈ Sn Δ . In ...
متن کاملContributions to differential geometry of spacelike curves in Lorentzian plane L2
In this work, first the differential equation characterizing position vector of spacelike curve is obtained in Lorentzian plane $mathbb{L}^{2}.$ Then the special curves mentioned above are studied in Lorentzian plane $mathbb{L}%^{2}.$ Finally some characterizations of these special curves are given in $mathbb{L}^{2}.$
متن کاملar X iv : m at h / 06 01 04 7 v 1 [ m at h . A G ] 3 J an 2 00 6 SEVERAL APPLICATIONS OF BEZOUT MATRICES
The notion of Bezout matrix is an essential tool in studying broad variety of subjects: zeroes of polynomials, stability of differential equations, rational transformations of algebraic curves, systems of commuting nonselfadjoint operators, boundaries of quadrature domains etc. We present a survey of several properties of Bezout matrices and their applications in all mentioned topics. We use th...
متن کامل